ipred : Improved Predictors

ثبت نشده
چکیده

In classification problems, there are several attempts to create rules which assign future observations to certain classes. Common methods are for example linear discriminant analysis or classification trees. Recent developments lead to substantial reduction of misclassification error in many applications. Bootstrap aggregation (“bagging”, Breiman, 1996a) combines classifiers trained on bootstrap samples of the original data. Another approach is indirect classification, which incorporates a priori knowledge into a classification rule (Hand et al., 2001). Since the misclassification error is a criterion to assess the classification techniques, its estimation is of main importance. A nearly unbiased but highly variable estimator can be calculated by cross validation. Efron and Tibshirani (1997) discuss bootstrap estimates of misclassification error. As a by-product of bagging, Breiman (1996b) proposes the out-of-bag estimator. However, the calculation of the desired classification models and their misclassification errors is often aggravated by different and specialized interfaces of the various procedures. We propose the ipred package as a first attempt to create a unified interface for improved predictors and various error rate estimators. In the following we demonstrate the functionality of the package in the example of glaucoma classification. We start with an overview

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice.

متن کامل

1 1 Se p 20 00 Predictability , complexity and learning

We define predictive information Ipred(T ) as the mutual information between the past and the future of a time series. Three qualitatively different behaviors are found in the limit of large observation times T : Ipred(T ) can remain finite, grow logarithmically, or grow as a fractional power law. If the time series allows us to learn a model with a finite number of parameters, then Ipred(T ) g...

متن کامل

0 Ju l 2 00 0 Predictability , complexity and learning

We define predictive information Ipred(T ) as the mutual information between the past and the future of a time series. Three qualitatively different behaviors are found in the limit of large observation times T : Ipred(T ) can remain finite, grow logarithmically, or grow as a fractional power law. If the time series allows us to learn a model with a finite number of parameters, then Ipred(T ) g...

متن کامل

IPRed: Instance Reduction Algorithm Based on the Percentile of the Partitions

Instance reduction methods are popular methods that reduce the size of the datasets to possibly improve the classification accuracy. We present a method that reduces the size of the dataset based on the percentile of the dataset partitions which we call IPRed. We evaluate our and other popular instance reduction methods from a classification perspective by 1-nearest neighbor algorithm on many r...

متن کامل

Learning lessons in emergency management: the 4th International Conference on Healthcare System Preparedness and Response to Emergencies and Disasters

BACKGROUND The International Preparedness & Response to Emergencies & Disasters (IPRED) conferences are conducted bi-annually in order to share insights and lessons learned from diverse crises. The aim of the article is to bring the IPRED conferences into better professional attention and to share the main insights that were presented in IPRED IV, which was held in January 2016. MAIN BODY The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017